Möbius conjugation and convolution formulae

نویسنده

  • Suijie Wang
چکیده

Let P be a locally finite poset with the interval space Int(P ), and R a ring with identity. We shall introduce the Möbius conjugation μ∗ sending each function f : P → R to an incidence function μ∗(f) : Int(P ) → R such that μ∗(fg) = μ∗(f) ∗μ∗(g). Taking P to be the intersection poset of a hyperplane arrangement A, we shall obtain a convolution identity for the number r(A) of regions and the number b(A) of relatively bounded regions, and a reciprocity theorem of the characteristic polynomial χ(A, t), which also leads to a combinatorial interpretation to the values |χ(A,−q)| for large primes q. Moreover, all known convolution identities on Tutte polynomials of matroids will be direct consequences after specializing the poset P and functions f, g.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

18.781 (Spring 2016): Floor and arithmetic functions

2. Arithmetic functions 19 2.1. Arithmetic functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 2.2. Multiplicative functions . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.3. The Dirichlet convolution . . . . . . . . . . . . . . . . . . . . . . . . 27 2.4. Examples of Dirichlet convolutions . . . . . . . . . . . . . . . . . . . 34 2.5. Möbius inversion . . . . . . . . . ....

متن کامل

ASYMPTOTIC FORMULAE CONCERNING ARITHMETICAL FUNCTIONS DEFINED BY CROSS-CONVOLUTIONS, I. DIVISOR-SUM FUNCTIONS AND EULER-TYPE FUNCTIONS By László Tóth (Cluj-Napoca)

Abstract. We introduce the notion of cross-convolution of arithmetical functions as a special case of Narkiewicz’s regular convolution. We give asymptotic formulae for the summatory functions of certain generalized divisor-sum functions and Euler-type functions related to cross-convolutions and to arbitrary sets of positive integers. These formulae generalize and unify many known results concer...

متن کامل

On the binomial convolution of arithmetical functions

Let n = ∏ p p νp(n) denote the canonical factorization of n ∈ N. The binomial convolution of arithmetical functions f and g is defined as (f ◦g)(n) = ∑ d|n (∏ p (νp(n) νp(d) )) f(d)g(n/d), where ( a b ) is the binomial coefficient. We provide properties of the binomial convolution. We study the Calgebra (A,+, ◦,C), characterizations of completely multiplicative functions, Selberg multiplicative...

متن کامل

Convolution surfaces based on polygons for infinite and compact support kernels

We provide mathematical formulae to create 3D smooth shapes fleshing out a skeleton made of line segments and polygons. The boundary of the shape created is a level set of a convolution function. This latter is obtained through the integration of a kernel function along the skeleton. The technique has been proposed and developed for geometric modeling in computer graphics. Given the additivity ...

متن کامل

Ito’s and Tanaka’s type formulae for the stochastic heat equation: the linear case

In this paper we consider the linear stochastic heat equation with additive noise in dimension one. Then, using the representation of its solution X as a stochastic convolution of the cylindrical Brownian motion with respect to an operator-valued kernel, we derive Itô’s and Tanaka’s type formulae associated to X.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2015